Method and apparatus for calculating blood flow parameters

ABSTRACT

A method for determining tissue type includes quantitatively determining a tissue blood flow (TBF) by deconvoluting Q(t) and C a (t), where Q(t) represents a curve of specific mass of contrast, and C a (t) represents an arterial curve of contrast concentration, and quantitatively determining a tissue blood volume (TBV) by deconvoluting Q(t) and C a (t). The method also includes quantitatively determining a tissue mean transit time (TMTT) by deconvoluting Q(t) and C a (t), and quantitatively determining a tissue capillary permeability surface area product (TPS) by deconvoluting Q(t) and C a (t). The method also includes determining a tissue type based on the TBF, the TBV, the TMTT, and the TPS.

CROSS REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. provisional application No. 60/243,196 filed Oct. 25, 2000.

BACKGROUND OF THE INVENTION

This invention relates generally to methods and apparatus for imaging systems and, more particularly, for calculating blood flow parameters.

Stroke is a leading cause of disability among adults in North America. A National Institute for Neurological Diseases and Stroke (NINDS) trial was the first study to demonstrate that thrombolytic treatment within the first 3 hours of symptom onset is beneficial to stroke victims. However, treating patients beyond the initial 3 hours of illness with a thrombolytic treatment may carry a risk of intracranial bleeding which has resulted in a setback in the use of thrombolysis. This setback in the use of thrombolysis has prompted the realization that a more rigorous selection of patients according to certain criteria may reduce the risk of intracranial bleeding and thus, extend the therapeutic window for this therapy beyond the current 3-hour limit to benefit more patients.

BRIEF SUMMARY OF THE INVENTION

In one aspect, a method for determining tissue type is provided. The method includes quantitatively determining a tissue blood flow (TBF) by deconvoluting Q(t) and C_(a)(t), where Q(t) represents a curve of specific mass of contrast, and C_(a)(t) represents an arterial curve of contrast concentration, and quantitatively determining a tissue blood volume (TBV) by deconvoluting Q(t) and C_(a)(t). The method also includes quantitatively determining a tissue mean transit time (TMTT) by deconvoluting Q(t) and C_(a)(t), and quantitatively determining a tissue capillary permeability surface area product (TPS) by deconvoluting Q(t) and C_(a)(t). The method also includes determining a tissue type based on the TBF, the TBV, the TMTT, and the TPS.

In another aspect, a system including at least one of a computed tomography system and a nuclear magnetic resonance system is provided. The system is configured to quantitatively determine a tissue blood flow (TBF) by deconvoluting Q(t) and C_(a)(t), where Q(t) represents a curve of specific mass of contrast, and C_(a)(t) represents an arterial curve of contrast concentration, and quantitatively determine a tissue blood volume (TBV) by deconvoluting Q(t) and C_(a)(t). The system is also configured to quantitatively determine a tissue mean transit time (TMTT) by deconvoluting Q(t) and C_(a)(t), and quantitatively determine a tissue capillary permeability surface area product (TPS) by deconvoluting Q(t) and C_(a)(t). The system is also configured to determine a tissue type based on the TBF, the TBV, the TMTT, and the TPS.

In another embodiment, a computer readable medium encoded with a program executable by a computer for processing scanning data is provided. The program is configured to instruct the computer to quantitatively determine a tissue blood flow (TBF) by deconvoluting Q(t) and C_(a)(t), where Q(t) represents a curve of specific mass of contrast, and C_(a)(t) represents an arterial curve of contrast concentration, and quantitatively determine a tissue blood volume (TBV) by deconvoluting Q(t) and C_(a)(t). The program is also configured to instruct the computer to quantitatively determine a tissue mean transit time (TMTT) by deconvoluting Q(t) and C_(a)(t), and quantitatively determine a tissue capillary permeability surface area product (TPS) by deconvoluting Q(t) and C_(a)(t). The program is also configured to instruct the computer to determine a tissue type based on the TBF, the TBV, the TMTT, and the TPS.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a pictorial view of a CT imaging system.

FIG. 2 is a block schematic diagram of the system illustrated in FIG. 1.

FIG. 3 is a schematic illustration of a Nuclear Magnetic Resonance (NMR) system.

DETAILED DESCRIPTION OF THE INVENTION

At present, there are both experimental and clinical data to suggest that the level of residual blood flow in the ischemic zone could be a useful indicator of the risk of intracranial bleeding.

The importance of absolute measurement in stroke is also predicated by the fact that there exist distinct thresholds of cerebral blood flow (CBF) for various functions of the brain. It is possible to use these thresholds to decide whether a particular brain region is salvageable, hence thrombolytics should be used to restore CBF, or is already infarcted such that thrombolysis would achieve little but instead would increase the risk of intracranial bleeding.

The brain has an intricate system of control to maintain cerebral normal limits when cerebral perfusion pressure decreases but remains within certain limits. This is achieved by dilation of the resistance blood vessels, i.e. the arterioles, vascular resistance and an increase of the cerebral blood volume (CBV). The concept of autoregulation of CBF can be used to advantage in stroke. For ischemic but viable tissue, autoregulation would lead to increased CBV so that mean transit time (MTT) is prolonged since MTT is the ratio of CBV and CBF because of the Central Volume Principle. On the other hand for ischemic but nonviable tissue, autoregulation is abolished such that both CBV and CBF are reduced but MTT may remain normal or only slightly elevated.

In summary, the absolute measurements of CBF, CBV and MTT would permit the distinction between salvageable and infarcted tissue by the following criteria:

Ischemic Tissue Type CBF CBV MTT Viable −− + ++ Infarcted −− − −/+

Wherein −− designates a large decrease, − designates a slight decrease, + designates a slight increase, ++ designates a large increase, and −/+ designates either a slight increase of a slight decrease.

It is the mismatch between CBF and CBV that discriminates salvageable and infarcted tissue. The corollary of this is that measurement of CBF alone will not reliably differentiate between viable and non-viable ischemic tissue. In addition, the ability to monitor quantitative changes in CBV may obviate the need to perform supplementary tests to evaluate the ‘vascular’ reserve of a stroke patient. In brief, the classical test of ‘vascular’ reserve evaluates the change in CBF in response to increases in pCO2 (partial pressure of CO2) in brain tissue which can be induced either by increasing inspired air concentration of CO2 or by intravenous administration of a drug, such as a carbonic anhydrase inhibitor such as, for example, Diamox. For a normal brain, raised pCO2 in tissue would induce a large increase in CBF. For ischemic tissue, where autoregulation is still intact, because CBV is already activated, the increase in CBF will be attenuated. Thus, tissue with a positive reserve is viable whereas that with little or no reserve left is at risk of infarction.

As used herein Cerebral Blood Flow (CBF) is the volume flow of blood through vasculature including the large conductance vessels, arteries, arterioles, capillaries, venules, veins and sinuses. It typically has units of ml/min/100 g. Also as used herein, Cerebral Blood Volume (CBV) is the volume of blood in the vasculature including the large conductance vessels, arteries, arterioles, capillaries, venules, veins and sinuses. It typically has units of ml/g. Additionally, as used herein Mean Transit Time (MTT) references that blood traverses the vasculature through different pathlengths such that there does not exist an unique transit time from the arterial inlet to the venous outlet. Instead there is a distribution of transit times and the mean transit time is the mean time of such a distribution. Furthermore, Minimum Transit Time (TTmin), as used herein, is the minimum time interval between entry at the arterial inlet and exit at the venous outlet of blood or contrast medium. The Central Volume Principle relates the above three quantities in the following relationship: ${CBF} = {\frac{CBV}{MTT}.}$

Referring to FIGS. 1 and 2, a multi-slice scanning imaging system, for example, computed tomography (CT) imaging system 10, is shown as including a gantry 12 representative of a “third generation” CT imaging system. Gantry 12 has an x-ray source 14 that projects a beam of x-rays 16 toward a detector array 18 on the opposite side of gantry 12. Detector array 18 is formed by a plurality of detector rows (not shown) including a plurality of detector elements 20 which together sense the projected x-rays that pass through an object, such as a medical patient 22. Each detector element 20 produces an electrical signal that represents the intensity of an impinging x-ray beam and hence the attenuation of the beam as it passes through object or patient 22. During a scan to acquire x-ray projection data, gantry 12 and the components mounted thereon rotate about a center of rotation 24. FIG. 2 shows only a single row of detector elements 20 (i.e., a detector row). However, a multislice detector array 18 includes a plurality of parallel detector rows of detector elements 20 so that projection data corresponding to a plurality of parallel slices are, or can be acquired simultaneously during a scan.

Rotation of gantry 12 and the operation of x-ray source 14 are governed by a control mechanism 26 of CT system 10. Control mechanism 26 includes an x-ray controller 28 that provides power and timing signals to x-ray source 14 and a gantry motor controller 30 that controls the rotational speed and position of gantry 12. A data acquisition system (DAS) 32 in control mechanism 26 samples analog data from detector elements 20 and converts the data to digital signals for subsequent processing. An image reconstructor 34 receives sampled and digitized x-ray data from DAS 32 and performs high-speed image reconstruction. The reconstructed image is applied as an input to a computer 36 which stores the image in a mass storage device 38.

Computer 36 also receives commands and scanning parameters from an operator via console 40 that has a keyboard. An associated cathode ray tube display 42 allows the operator to observe the reconstructed image and other data from computer 36. The operator supplied commands and parameters are used by computer 36 to provide control signals and information to DAS 32, x-ray controller 28 and gantry motor controller 30. In addition, computer 36 operates a table motor controller 44 which controls a motorized table 46 to position patient 22 in gantry 12. Particularly, table 46 moves portions of patient 22 through gantry opening 48. In one embodiment, computer 36 includes a device 50, for example, a floppy disk drive or CD-ROM drive, for reading instructions and/or data from a computer-readable medium 52, such as a floppy disk or CD-ROM. In another embodiment, computer 36 executes instructions stored in firmware (not shown). Computer 36 is programmed to perform functions described herein, accordingly, as used herein, the term computer is not limited to just those integrated circuits referred to in the art as computers, but broadly refers to computers, processors, microcontrollers, microcomputers, programmable logic controllers, application specific integrated circuits, and other programmable circuits.

In one embodiment, system 10 is used to perform CT scans and determines blood flow parameters such as Tissue Blood Flow (TBF), Tissue Blood Volume (TBV), Tissue Mean Transit Time (TMTT) and Tissue Capillary Permeability Surface Area Product (TPS) as described below. In another embodiment, a Nuclear Magnetic Resonance (NMR) system 100 (see FIG. 3) scans and determines TBF, TBV, TMTT and TPS blood flow parameters such as described below. In an exemplary embodiment, system 10 scans and determines cerebral blood flow parameters such as Cerebral Blood Flow (CBF), Cerebral Blood Volume (CBV), and Cerebral Mean Transit Time (CMTT).

In one embodiment, system 10 is used to determine tissue type. More specifically, a tissue blood flow (TBF) is quantitatively determined by deconvoluting Q(t) and Ca(t), where Q(t) represents the tissue residue function and is a curve of specific mass of contrast in tissue, and Ca(t) represents an arterial curve of contrast concentration. Also a tissue blood volume (TBV), a tissue mean transit time (TMTT), and a tissue capillary permeability surface area product (TPS) are quantitatively determined by deconvoluting Q(t) and Ca(t). In another embodiment, a Nuclear Magnetic Resonance (NMR) system 100 (see FIG. 3) scans and determines tissue type by quantitatively determining TBF, TBV, TMTT and TPS.

In one embodiment, the arterial curve of contrast concentration measured by system 10 and NMR system 100 (see FIG. 3) is corrected for partial volume averaging as described herein. For example, during a cranial scan, but not limited to cranial scans, arterial regions within the vascular territories of the cerebral arteries (anterior and middle) are identified, and used to generate the measured arterial curve of contrast concentration, C_(a)′(t). The measured arterial curve of contrast concentration is related to the arterial curve of contrast concentration, C_(a)(t) by C_(a)′(t)=kC_(a)(t), where k is the partial volume averaging scaling factor as explained in greater detail below. A venous region either within the sagittal or tranverse sinuses is located, and C_(v)(t) is generated where C_(v)(t)=C_(a)(t)*h(t) and h(t) is the transit time spectrum of the brain, as explained herein. C_(a)′(t) and C_(v)(t) are deconvolved to find $\frac{h(t)}{k}.$ And a trailing slope of C_(a)′(t) is extrapolated with a monoexponential function to find C_(a,ex)′(t) which is convolved with $\frac{h(t)}{k}$ to find C_(v,ex)(t). Where k is a partial volume averaging (PVA) scaling factor and is determined according to $k = {\frac{\int_{0}^{\infty}{{C_{a,{ex}}^{\prime}(t)}\quad{\mathbb{d}t}}}{\int_{0}^{\infty}{{C_{v,{ex}}(t)}\quad{\mathbb{d}t}}}.}$ The measured arterial curve of contrast concentration, C_(a)′(t), is then corrected for partial volume averaging by dividing with the factor k to arrive at the arterial curve of contrast concentration, C_(a)(t).

A CBF and a CBV functional maps are generated with C_(a)′(t) and divided by the PVA scaling factor, k.

In one embodiment, a convolution integral for a tissue residue function Q(t) is: Q(t) = ∫₀^(t)C_(a)(t − u)h(u)  𝕕u

where C_(a)(t) is an arterial curve of contrast concentration curve and h(t) is an impulse residue function. Additionally, Q(t) is equal to the convolution of C_(a)(t) and h(t) when the system is linear and stationary. Note that when C_(a)(t)=δ(t−u), then the tissue residue function Q(t) is: Q(t) = ∫₀^(t)δ(t − u)h(u)  𝕕u = h(t)

This relationship lends itself to the following interpretation of the convolution integral, e.g. ${{C_{a}(t)} = {\sum\limits_{n}{{C_{a}\left( {t - {n\quad\Delta\quad t}} \right)}{\delta\left( {t - {n\quad\Delta\quad t}} \right)}}}},$ therefore the tissue residue function Q(t) is: $\quad\begin{matrix} {{{Q(t)} = {\int_{0}^{t}{{C_{a}\left( {t - u} \right)}{h(u)}\quad{\mathbb{d}u}}}},} & {{which}\quad{is}} \\ {\quad{{= {\int_{0}^{t}{\sum\limits_{n}{\left\lbrack {{C_{a}\left( {t - u} \right)}{\delta\left( {t - u - {n\quad\Delta\quad t}} \right)}} \right\rbrack{h(u)}\quad{\mathbb{d}u}}}}},}} & {{which}\quad{is}} \\ {\quad{{= {\sum\limits_{n}{\int_{0}^{t}{{C_{a}\left( {t - u} \right)}{\delta\left( {t - u - {n\quad\Delta\quad t}} \right)}{h(u)}\quad{\mathbb{d}u}}}}},}} & {{which}\quad{is}} \\ {\quad{= {\sum\limits_{n}{{C_{a}\left( {n\quad\Delta\quad t} \right)}{{h\left( {t - {n\quad\Delta\quad t}} \right)}.}}}}} & \quad \end{matrix}\quad$

A discretization of the tissue residue function convolution integral is determined by dividing a time interval [0,t] into m equal intervals of length Δt, each using the rectangular rule for quadrature of the convolution integral, according to: ${Q(t)} = {{Q\left( {m\quad\Delta\quad t} \right)} = {\sum\limits_{i = 0}^{m - 1}\quad{{C_{a}\left( {\left\lbrack {m - i} \right\rbrack\Delta\quad t} \right)}{h\left( {i\quad\Delta\quad t} \right)}\Delta\quad{t.}}}}$

In a matrix notation, the convolution integral for the tissue residue function after discretization is Q=Ah and therefore Q=Ah is: $\begin{pmatrix} {Q\left( {\Delta\quad t} \right)} \\ {Q\left( {2\Delta\quad t} \right)} \\ \vdots \\ {Q\left( {\left( {M - 1} \right)\Delta\quad t} \right)} \\ {Q\left( {M\quad\Delta\quad t} \right)} \end{pmatrix} = {\quad{\begin{bmatrix} {C_{a}\left( {\Delta\quad t} \right)} & 0 & 0 & \cdots & \cdots & 0 \\ {C_{a}\left( {2\Delta\quad t} \right)} & {C_{a}\left( {\Delta\quad t} \right)} & 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ {C_{a}\left( {\left( {M - 1} \right)\Delta\quad t} \right)} & {C_{a}\left( {\left( {M - 2} \right)\Delta\quad t} \right)} & \cdots & \cdots & \cdots & \left. {{C_{a}\left( {M - N} \right)}\Delta\quad t} \right) \\ {C_{a}\left( {M\quad\Delta\quad t} \right)} & {C_{a}\left( {\left( {M - 1} \right)\Delta\quad t} \right)} & {C_{a}\left( {\left( {M - 2} \right)\Delta\quad t} \right)} & \cdots & \cdots & {{C_{a}\left( \left( {M - N + 1} \right) \right)}\Delta\quad t} \end{bmatrix}\begin{pmatrix} {h(0)} \\ {h\left( {\Delta\quad t} \right)} \\ {h\left( {2\Delta\quad t} \right)} \\ \vdots \\ {h\left( {\left( {N - 1} \right)\Delta\quad t} \right)} \end{pmatrix}}}$

where Q is a M×1 vector, A is a M×N matrix, and h is a N×1 vector. A least squares solution, ĥ, of Q=Ah facilitates minimizing the norm of a tissue residue vector, r=Q=Aĥ according to: ∥r∥²=∥Q−Aĥ∥².

In one embodiment, an equality constraint is incorporated into the least squares problem such that when h is the impulse residue function of a linear and stationary flow system, it will satisfy the time causality, i.e. if the injection of tracer does not occur at time zero, then some beginning elements of h should be set to zero (time causality), and defining a minimum transit time, i.e. h will have a plateau of a duration equal to the minimum transit time. The requirement for time causality and minimum transit time can be written as the following equalities: $\begin{matrix} {h_{1} = 0} \\ {h_{2} = 0} \\ \vdots \\ {h_{I} = 0} \\ {h_{I + 1} = h_{I + 2}} \\ {h_{I + 2} = h_{I + 3}} \\ \vdots \\ {h_{I + L - 1} = h_{I + L}} \end{matrix}$

where the first I elements of h are zero, and the duration of the plateau is (L−1) dt, where dt is the sampling interval of each element of h. The equality constraints can be written compactly as the matrix equation Ch=b: $C = {\begin{matrix} I \\ \quad \\ \quad \\ \quad \\ {L - 1} \\ \quad \end{matrix}\begin{bmatrix} \overset{\overset{I}{︷}}{\begin{matrix} 1 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \cdots & \vdots \\ 0 & 0 & \cdots & 1 \\ 0 & 0 & \vdots & 0 \\ 0 & 0 & \vdots & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & \cdots & 0 \\ \quad & \quad & \quad & \quad \end{matrix}} & \overset{\overset{L}{︷}}{\begin{matrix} 0 & 0 & 0 & \cdots & 0 & 0 \\ 0 & 0 & 0 & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \cdots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & 0 & 0 \\ 1 & {- 1} & 0 & \cdots & 0 & 0 \\ 0 & 1 & {- 1} & \cdots & 0 & 0 \\ \vdots & \vdots & \vdots & \cdots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & 1 & {- 1} \\ \quad & \quad & \quad & \quad & \quad & \quad \end{matrix}} & \overset{\overset{N - I - L}{︷}}{\begin{matrix} 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ \vdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \vdots \\ 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ \vdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \vdots \\ 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ \quad & \quad & \quad & \quad & \quad & \quad & \quad & \quad & \quad & \quad \end{matrix}} \end{bmatrix}}$

where C is a M₁×N matrix, h is the impulse residue function, and b=0 is a N×1 zero vector. Note that M₁−I+L−1.

Also C can be partitioned as: $\begin{matrix} I \\ \quad \\ \quad \\ \quad \\ {L - 1} \\ \quad \end{matrix}\begin{bmatrix} \overset{\overset{C_{1}}{︷}}{\underset{\underset{{I + L} = {1 = M_{1}}}{︸}}{\begin{matrix} 1 & 0 & \cdots & 0 & 0 & 0 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 & 0 & 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \cdots & \vdots & \vdots & \vdots & \vdots & \cdots & 0 \\ 0 & 0 & \cdots & 1 & 0 & 0 & 0 & \cdots & 0 \\ 0 & 0 & \vdots & 0 & 1 & {- 1} & 0 & \cdots & 0 \\ 0 & 0 & \vdots & 0 & 0 & 1 & {- 1} & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \cdots & \vdots \\ 0 & 0 & \cdots & 0 & 0 & 0 & 0 & \cdots & 1 \end{matrix}}} & \overset{\overset{C_{2}}{︷}}{\underset{\underset{{N - {({I + L - 1})}} = {N - M_{1}}}{︸}}{\begin{matrix} 0 & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ \vdots & \vdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \vdots \\ 0 & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ 0 & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \\ \vdots & \vdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \vdots \\ {- 1} & 0 & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & \cdots & 0 \end{matrix}}} \end{bmatrix}$ where C₁ is a M₁×M₁ square matrix with full rank, and C₂ is a M₁×(N−M₁) matrix with only one nonzero element, wherein the nonzero element (M₁+1, l)th element is equal to −1. Similarly h can be partitioned as: ${h = \begin{pmatrix} h_{1} \\ h_{2} \end{pmatrix}},$ where h₁ is a M₁×1 vector of the first M₁ elements of h₁ and h₂ is a N−M₁×1 vector of the remaining elements.

With these partitions of C and h, the constraint equation, Ch=b, can be written as: ${\left\lbrack {C_{1}\quad C_{2}} \right\rbrack\begin{pmatrix} h_{1} \\ h_{2} \end{pmatrix}} = {\left. b\Rightarrow{C_{1}h_{1}} \right. = {\left( {b - {C_{2}h_{2}}} \right).}}$ Since C₁ is square and of full rank, its inverse exists, then the constraint equation can be written as: h₁=C₁ ⁻¹(b−C₂h₂), where the inverse of C₁ is: $\begin{matrix} I \\ \quad \\ \quad \\ {C_{1}^{- 1} =} \\ \quad \\ {L - 1} \end{matrix}\begin{bmatrix} \begin{matrix} \underset{︷}{I} \\ \begin{matrix} 1 & 0 & \cdots & 0 \\ 0 & 1 & \cdots & 0 \\ \vdots & \vdots & \ddots & \vdots \\ 0 & 0 & \cdots & 1 \end{matrix} \end{matrix} & \begin{matrix} \underset{︷}{L - 1} \\ \begin{matrix} 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & 0 & 0 \end{matrix} \end{matrix} \\ \begin{matrix} 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{matrix} & \begin{matrix} 1 & 1 & \cdots & 1 & 1 \\ 0 & 1 & \cdots & 1 & 1 \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & 1 & 1 \\ 0 & 0 & 0 & 0 & 1 \end{matrix} \end{bmatrix}$

As a check, h₁=C₁ ⁻¹(b−C₂h₂) is evaluated to ensure that it does not violate the constraint described herein. For example, since b is a zero vector, h₁ can be simplified as: h₁=−C₁ ⁻¹C₂h₂. As stated previously herein, C₂ is a M₁×N−M₁ matrix of the form: $C_{2} = {\begin{bmatrix} 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & \cdots & 0 \\ {- 1} & 0 & \cdots & 0 \end{bmatrix} = {\left\lbrack {\begin{matrix} \overset{1}{︷} \\ 0 \\ 0 \\ \vdots \\ 0 \\ {- 1} \end{matrix}\begin{matrix} \underset{︷}{N - M_{1} - 1} \\ \begin{matrix} 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 \\ \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & \cdots & 0 \\ 0 & 0 & \cdots & 0 \end{matrix} \end{matrix}} \right\rbrack = \begin{bmatrix} 0 & 0 \\ {- 1} & 0 \end{bmatrix}}}$ and h₂ can be partitioned as: $h_{2} = {\begin{pmatrix} h_{M_{1} + 1} \\ h_{M_{1} + 2} \\ \vdots \\ h_{N} \end{pmatrix} = \begin{pmatrix} h_{M_{1} + 1} \\ h_{2} \end{pmatrix}}$ then, $\begin{matrix} {{C_{2}h_{2}} = {{\,_{1}^{M_{i} - 1}\begin{bmatrix} \overset{\overset{1}{︷}}{0} & \overset{\overset{N - M_{i} - 1}{︷}}{0} \\ {- 1} & 0 \end{bmatrix}}\begin{pmatrix} h_{M_{i} + 1} \\ h_{2} \end{pmatrix}\begin{matrix} 1 \\ {N - M_{i} - 1} \end{matrix}}} \\ {{= {\begin{pmatrix} 0 \\ {- h_{M_{i} + 1}} \end{pmatrix}\begin{matrix} {M_{i} - 1} \\ 1 \end{matrix}\quad{and}}},} \\ {h_{1} = {\begin{pmatrix} h_{1} \\ h_{2} \\ \vdots \\ h_{I} \\ h_{I + 1} \\ h_{I + 2} \\ \vdots \\ h_{I + L} \end{pmatrix} = {- {C_{1}^{- 1}\begin{pmatrix} O \\ {- h_{M_{i} + 1}} \end{pmatrix}}}}} \\ {= {\,_{L - 1}^{1}\left\lbrack {\frac{\overset{\overset{M_{i} - 1}{︷}}{X}}{X}\left. \begin{matrix} \begin{matrix} \overset{\overset{1}{︷}}{0} \\ 0 \\ \vdots \\ 0 \\ \quad \\ {- 1} \\ {- 1} \\ \vdots \end{matrix} \\ {- 1} \end{matrix} \right\rbrack\begin{pmatrix} O \\ {- h_{M_{i} + 1}} \end{pmatrix}\begin{matrix} {M_{i} - 1} \\ 1 \end{matrix}} \right.}} \\ {= {\left( \frac{\begin{matrix} 0 \\ 0 \\ \vdots \\ 0 \end{matrix}}{\begin{matrix} h_{M_{i} + 1} \\ h_{M_{i} + 1} \\ \vdots \\ h_{M_{i} + 1} \end{matrix}} \right)\begin{matrix} I \\ {L - 1} \end{matrix}}} \end{matrix}$ as the time causality and minimum transit time constraints required.

In one embodiment, the equality constraint Ch=b affect on the solution of the least squares problem Q=Ah can be determined according to: First, A is partitioned in the same way as C: ${A =_{M}\left\lbrack \begin{matrix} {\overset{\overset{M_{1}}{︷}}{A_{1}},} & \overset{\overset{N - M_{1}}{︷}}{A_{2}} \end{matrix}\quad \right\rbrack},$ then Ah can be written as: ${Ah} = {{\left\lbrack {A_{1},A_{2}} \right\rbrack\begin{pmatrix} h_{1} \\ h_{2} \end{pmatrix}} = {{{A_{1}h_{1}} + {A_{2}h_{2}}} = {{{A_{1}\left( {{- C_{1}^{- 1}}C_{2}h_{2}} \right)} + {A_{2}h_{2}}} = {\left( {A_{2} - {A_{1}C_{1}^{- 1}C_{2}}} \right){h_{2}.}}}}}$ Therefore with the equality constraint, Ch=b, the least squares problem Ah=Q is equivalent to the ‘reduced’ problem of (A₂−A₁C₁ ⁻¹C₂)h₂=Q or in short A_(r)h₂=Q where A_(r)=(A₂−A₁C₁ ⁻¹C₂).

From the least squares solution, ĥ₂, of the reduced problem A_(r)h₂=Q, the full impulse residue function, h, can be reconstituted by: $h = \begin{pmatrix} h_{1} \\ {\hat{h}}_{2} \end{pmatrix}$ and h₁ is a (I+L−1)×1 vector whose first I elements are zero and the subsequent L−1 elements are equal to the first element of ĥ₂.

For example, for the evaluation of A₂−A₁C₁ ⁻¹C₂ ${\begin{matrix} 1 \\ \quad \\ \quad \\ {{C_{1}^{- 1}C_{2}} = {M_{1} - 1}} \\ \quad \end{matrix}\begin{bmatrix} \begin{matrix} \overset{M_{1} - 1}{︷} \\ X \end{matrix} & \begin{matrix} \overset{1}{︷} \\ 0 \end{matrix} \\ X & \begin{matrix} 0 \\ \vdots \\ 0 \\ 1 \\ \vdots \\ 1 \end{matrix} \end{bmatrix}}{\begin{matrix} \quad \\ \quad \\ \quad \\ {M_{1} - 1} \\ \quad \\ \quad \\ \quad \\ 1 \end{matrix}\begin{bmatrix} \begin{matrix} \overset{1}{︷} \\ 0 \\ 0 \\ \vdots \\ \vdots \\ \vdots \\ 0 \end{matrix} & \begin{matrix} \overset{N - M_{1} - 1}{︷} \\ \quad \\ \quad \\ 0 \\ \quad \\ \quad \\ \quad \end{matrix} \\ {- 1} & {0\quad\cdots\quad 0} \end{bmatrix}}$ ${\begin{matrix} 1 \\ \quad \\ \quad \\ {= {M_{1} - 1}} \\ \quad \end{matrix}\begin{bmatrix} \begin{matrix} \overset{1}{︷} \\ 0 \end{matrix} & \begin{matrix} \overset{N - M_{1} - 1}{︷} \\ {0\quad\cdots\quad 0} \end{matrix} \\ \begin{matrix} 0 \\ \vdots \\ 0 \\ {- 1} \\ \vdots \\ {- 1} \end{matrix} & \begin{matrix} \quad \\ \quad \\ 0 \\ \quad \\ \quad \\ \quad \end{matrix} \end{bmatrix}} = {\begin{matrix} \quad \\ {M_{1} - L + 1} \\ \quad \\ \quad \\ \quad \\ \quad \\ {L - 1} \\ \quad \end{matrix}\begin{bmatrix} \begin{matrix} 1 \\ 0 \\ 0 \\ \vdots \\ 0 \end{matrix} & \begin{matrix} \overset{N - M_{1} - 1}{︷} \\ \quad \\ {\begin{matrix} 0 \\ \quad \end{matrix}\quad} \\ \quad \end{matrix} \\ {- 1} & \quad \\ \vdots & 0 \\ {- 1} & \quad \end{bmatrix}}$ where X is a plurality of partitions of matrices that are not used. A₁ is then partitioned according to: $A_{1} = {\begin{matrix} {M - L + 1} \\ {L - 1} \end{matrix}\left\lbrack \quad\begin{matrix} \overset{\overset{M_{1 - L + 1}}{︷}}{X} & \overset{\overset{L - 1}{︷}}{T_{1}} \\ X & T_{2} \end{matrix}\quad \right\rbrack}$ such that: ${A_{1}C_{1}^{- 1}C_{2}} = {{{\,_{L - 1}^{M - L + 1}\begin{bmatrix} \begin{matrix} \overset{M_{1} - L + 1}{︷} \\ X \end{matrix} & \begin{matrix} \overset{L - 1}{︷} \\ T_{1} \end{matrix} \\ X & T_{2} \end{bmatrix}}{\,_{L - 1}^{M_{1} - L + 1}\begin{bmatrix} \begin{matrix} \begin{matrix} \begin{matrix} \begin{matrix} \overset{1}{︷} \\ 0 \end{matrix} \\ 0 \end{matrix} \\ \vdots \end{matrix} \\ 0 \end{matrix} & \begin{matrix} \begin{matrix} \begin{matrix} \overset{N - M_{1} - 1}{︷} \\ \quad \end{matrix} \\ 0 \end{matrix} \\ \quad \end{matrix} \\ \begin{matrix} \begin{matrix} {- 1} \\ \vdots \end{matrix} \\ {- 1} \end{matrix} & 0 \end{bmatrix}}} = {\,_{L - 1}^{M - L + 1}\begin{bmatrix} \begin{matrix} \begin{matrix} \overset{1}{︷} \\ \quad \end{matrix} \\ {T_{1}\begin{pmatrix} {- 1} \\ \vdots \\ {- 1} \end{pmatrix}} \end{matrix} & \overset{\overset{N - M_{1} - 1}{︷}}{0} \\ {T_{2}\begin{pmatrix} {- 1} \\ \vdots \\ {- 1} \end{pmatrix}} & 0 \end{bmatrix}}}$ therefore, A₂−A₁C₁ ⁻¹C₂ is the same as A₂ except that its first column is modified by adding the M×1 vector $\,_{L - 1}^{M - L + 1}\begin{bmatrix} {T_{1}\begin{pmatrix} 1 \\ \vdots \\ 1 \end{pmatrix}} \\ {T_{2}\begin{pmatrix} 1 \\ \vdots \\ 1 \end{pmatrix}} \end{bmatrix}$ to it.

In one embodiment, a smoothness constraint by Lagrange Multiplier is incorporated into the least squares solution of the reduced problem A_(r)h₂=Q. In fact, if h is the impulse residue function of a physiologically realizable flow system, then its elements would change smoothly. In one embodiment, a matrix γF is appended to A_(r)=(A₂−A₁C₁ ⁻¹C₂) and vector γd to Q to the reduced problem to obtain: $\begin{pmatrix} q \\ {\gamma\quad d} \end{pmatrix} = {\left. {\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}h_{2}}\Leftrightarrow p \right. = {{{Eh}_{2}\quad{where}\quad p} = \begin{pmatrix} q \\ {\gamma\quad d} \end{pmatrix}}}$ is a M₂×1 vector and $E = \begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}$ is a M₂×(N−M₁) matrix, and p=Eh₂ is referred to the appended reduced problem.

The least squares solution, ĥ₂, of the appended reduced problem p=Eh₂ facilitates minimizing the normal of the residual vector according to: $\begin{matrix} {{r}^{2} = {\left( {\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix} - {\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}{\hat{h}}_{2}}} \right)^{T}\left( {\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix} - {\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}{\hat{h}}_{2}}} \right)}} \\ {= {\left( {\left\lbrack {Q^{T}\quad\gamma\quad d^{T}} \right\rbrack - {{\hat{h}}_{2}^{T}\left\lbrack {A_{r}^{T}\quad\gamma\quad S^{T}} \right\rbrack}} \right)\left( {\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix} - {\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}{\hat{h}}_{2}}} \right)}} \\ {= {{\left\lbrack {Q^{T}\quad\gamma\quad d^{T}} \right\rbrack\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix}} - {{{\hat{h}}_{2}^{T}\left\lbrack {A_{r}^{T}\quad\gamma\quad S^{T}} \right\rbrack}\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix}} - {{\left\lbrack {Q^{T}\quad\gamma\quad d^{T}} \right\rbrack\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}}{\hat{h}}_{2}} +}} \\ {{{{\hat{h}}_{2}^{T}\left\lbrack {A_{r}^{T}\quad\gamma\quad S^{T}} \right\rbrack}\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}}{\hat{h}}_{2}} \\ {= {{Q^{T}Q} + {\gamma^{2}d^{T}d} - {{\hat{h}}_{2}^{T}A_{r}^{T}Q} - {\gamma^{2}{\hat{h}}_{2}^{T}S^{T}d} - {Q^{T}A_{r}{\hat{h}}_{2}} - {\gamma^{2}d^{T}S{\hat{h}}_{2}} +}} \\ {{{\hat{h}}_{2}^{T}A_{r}^{T}A_{r}{\hat{h}}_{2}} + {\gamma^{2}{\hat{h}}_{2}^{T}S^{T}F{\hat{h}}_{2}}} \\ {= {{Q^{T}Q} - {{\hat{h}}_{2}^{T}A_{r}^{T}Q} - {q^{T}A_{r}{\hat{h}}_{2}} + {{\hat{h}}_{2}^{T}A_{r}^{T}A_{r}{\hat{h}}_{2}} +}} \\ {\gamma^{2}\left\lbrack {{d^{T}d} - {{\hat{h}}_{2}^{T}F^{T}d} - {d^{T}{Fh}_{2}} + {{\hat{h}}_{2}^{T}F^{T}F{\hat{h}}_{2}}} \right\rbrack} \\ {= {{{Q - {A_{r}{\hat{h}}_{2}}}}^{2} + {\gamma^{2}{{d - {S{\hat{h}}_{2}}}}^{2}}}} \end{matrix}$ where γ is the Lagrange multiplier and determines the relative weighting the least squares solution of the reduced problem places in minimizing ∥Q−A_(r)ĥ₂∥² and ∥d−Fĥ₂∥². If γ is large, then the solution will minimize ∥d−Fĥ₂∥² more than ∥Q−A_(r)ĥ₂∥².

The smoothness of the least squares estimate ĥ₂ of the appended reduced problem can be gauged by the norm of its second derivative with respect to time according to: ${\hat{h}}_{2} = {{\begin{pmatrix} {{\hat{h}}_{2}(1)} \\ {{\hat{h}}_{2}(2)} \\ \vdots \\ {{\hat{h}}_{2}\left( {N - M_{1}} \right)} \end{pmatrix}\frac{\mathbb{d}{\hat{h}}_{2}}{\mathbb{d}t}} = {{\frac{1}{\Delta\quad t}\begin{pmatrix} {{{\hat{h}}_{2}(1)} - {{\hat{h}}_{2}(0)}} \\ {{{\hat{h}}_{2}(2)} - {{\hat{h}}_{2}(1)}} \\ \vdots \\ {{{\hat{h}}_{2}\left( {N - M_{1}} \right)} - {{\hat{h}}_{2}\left( {N - M_{1} - 1} \right)}} \end{pmatrix}} = {\frac{1}{\Delta\quad t}\begin{pmatrix} {{\hat{h}}_{2}(1)} \\ {{\hat{h}(2)} - {\hat{h}(1)}} \\ \vdots \\ {{{\hat{h}}_{2}\left( {N - M_{1}} \right)} - {{\hat{h}}_{2}\left( {N - M_{1} - 1} \right)}} \end{pmatrix}}}}$ $\frac{\mathbb{d}^{2}{\hat{h}}_{2}}{\mathbb{d}t^{2}} = {{\frac{1}{\Delta\quad t^{2}}\begin{pmatrix} {{{\hat{h}}_{2}(1)} - {2{{\hat{h}}_{2}(0)}} + {{\hat{h}}_{2}\left( {- 1} \right)}} \\ {{{\hat{h}}_{2}(2)} - {2{{\hat{h}}_{2}(1)}} + {{\hat{h}}_{2}\left( {- 1} \right)}} \\ \vdots \\ {{{\hat{h}}_{2}\left( {N - M_{1}} \right)} - {2{{\hat{h}}_{2}\left( {N - M_{1} - 1} \right)}} + {{\hat{h}}_{2}\left( {N - M_{1} - 2} \right)}} \end{pmatrix}} = {{\frac{1}{\Delta\quad t^{2}}\begin{pmatrix} \begin{matrix} {{\hat{h}}_{2}(1)} \\ {{{\hat{h}}_{2}(2)} - {2{{\hat{h}}_{2}(1)}}} \end{matrix} \\ \vdots \\ {{{\hat{h}}_{2}\left( {N - M_{1}} \right)} - {2{{\hat{h}}_{2}\left( {N - M_{1} - 1} \right)}} + {{\hat{h}}_{2}\left( {N - M_{1} - 2} \right)}} \end{pmatrix}} = {{\frac{1}{\Delta\quad t^{2}}\begin{bmatrix} 1 & 0 & 0 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ {- 2} & 1 & 0 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ 1 & {- 2} & 1 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & {- 2} & 1 & \cdots & 0 & 0 & 0 & 0 & 0 \\ \quad & \quad & \quad & \quad & \cdots & \quad & \quad & \quad & \quad & \quad \\ 0 & 0 & 0 & 0 & \cdots & 0 & 1 & {- 2} & 1 & 0 \\ 0 & 0 & 0 & 0 & \cdots & 0 & 0 & 1 & {- 2} & 1 \end{bmatrix}}\begin{pmatrix} {{\hat{h}}_{2}(1)} \\ {{\hat{h}}_{2}(2)} \\ {{\hat{h}}_{2}(3)} \\ \vdots \\ {{\hat{h}}_{2}\left( {N - M_{1} - 2} \right)} \\ {{\hat{h}}_{2}\left( {N - M_{1} - 1} \right)} \\ {\hat{h}\left( {N - M_{1}} \right)} \end{pmatrix}}}}$ To incorporate the smoothness constraint, the matrix S is set according to: $S = {\frac{1}{\Delta\quad t^{2}}\begin{bmatrix} 1 & 0 & 0 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ {- 2} & 1 & 0 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ 1 & {- 2} & 1 & 0 & \cdots & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & {- 2} & 1 & \cdots & 0 & 0 & 0 & 0 & 0 \\ \quad & \quad & \quad & \quad & \cdots & \quad & \quad & \quad & \quad & \quad \\ 0 & 0 & 0 & 0 & \cdots & 0 & 1 & {- 2} & 1 & 0 \\ 0 & 0 & 0 & 0 & \cdots & 0 & 0 & 1 & {- 2} & 1 \end{bmatrix}}$ where d=0. The least square solution of the appended reduced problem facilitates minimizing both ∥Q−A_(r)ĥ₂∥² and ∥Sĥ₂∥² with the relative weighting controlled by γ.

In one embodiment, an inequality constraint is imposed on the solution of the appended reduced problem. The appended reduced problem is: $\begin{pmatrix} Q \\ {\gamma\quad d} \end{pmatrix} = {\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}h_{2}}$

-   -   which can be written as: p=Eh₂.

In another embodiment, the least squares estimate of the appended problem under the linear inequality constraint Gh₂≧b is determined. The dimension of the appended matrix E is M₂×(N−M₁). In one embodiment, E has a rank of K≦(N−M₁) and has the following singular value decomposition: $E = {{U\begin{bmatrix} S & 0 \\ 0 & 0 \end{bmatrix}}V^{T}}$ where S is a K×K diagonal matrix with its diagonal entries equal to the singular values of E, U and V are orthogonal matrices of dimensions M₂×M₂ and (N−M₁)×(N−M₁) respectively. The least squares solution, ĥ₂, of the appended reduced problem p=Eh₂ will minimize ∥Eh₂−p∥².

Using the singular value decomposition of E, ∥Eh₂−p∥² can be simplified as: $\begin{matrix} {{{{{Eh}_{2} - p}}^{2} = {{{{{U\begin{bmatrix} S & 0 \\ 0 & 0 \end{bmatrix}}V^{T}h_{2}} - p}}^{2} = {{{U^{T}{U\begin{bmatrix} S & 0 \\ 0 & 0 \end{bmatrix}}V^{T}h_{2}} - {U^{T}p}}}^{2}}},{{Since}\quad U^{T}\quad{is}\quad{orthogonal}}} \\ {= {{{{\begin{bmatrix} S & 0 \\ 0 & 0 \end{bmatrix}V^{T}h} - {U^{T}p}}}^{2} = {{{{{\begin{bmatrix} S & 0 \\ 0 & 0 \end{bmatrix}\begin{bmatrix} V_{1}^{T} \\ V_{2}^{T} \end{bmatrix}}h_{2}} - {\begin{bmatrix} U_{1}^{T} \\ U_{2}^{T} \end{bmatrix}p}}}^{2} = {{\begin{bmatrix} {{SV}_{1}^{T}h_{2}} \\ 0 \end{bmatrix} - \begin{bmatrix} {U_{1}^{T}p} \\ {U_{2}^{T}p} \end{bmatrix}}}^{2}}}} \\ {= {{\begin{bmatrix} {{{SV}_{1}^{T}h_{2}} - {U_{1}^{T}p}} \\ {{- U_{2}^{T}}p} \end{bmatrix}}^{2} = {{{{{SV}_{1}^{T}h_{2}} - {U_{1}^{T}p}}}^{2} + {{U_{2}^{T}p}}^{2}}}} \end{matrix}$

Since ∥U₂ ^(T)p∥² is constant, minimizing ∥Eh₂−p∥² is equivalent to minimizing ∥SV₁ ^(T)h₂−U₁ ^(T)p∥².

In one embodiment, the variable h₂ is changed to z such that z=SV₁ ^(T)h₂−U₁ ^(T)pV₁ ^(T)h₂=S⁻¹z+S⁻¹U₁ ^(T)p.

Minimizing ∥Eh₂−p∥² is the same as minimizing ∥z∥² and, therefore the inequality constraint becomes:

 Gh₂≧b G(V ₁ V ₁ ^(T) +V ₂ V ₂ ^(T))h ₂ ≧b GV ₁(S ⁻¹ z+S ⁻¹ U ₁ ^(T) p)+GV ₂ V ₂ ^(T) h ₂ ≧b GV ₁(S ⁻¹ z+S ⁻¹ U ₁ ^(T) p)+GV ₂ V ₂ ^(T) V ₁(S ⁻¹ z+S ⁻¹ U ₁ ^(T) p)≧b GV ₁ S ⁻¹ z+GV ₂ V ₂ ^(T) S ⁻¹ z≧b−GV ₁ S ⁻¹ U ₁ ^(T) p−GV ₂ V ₂ ^(T) V ₁ S ⁻¹ U ₁ ^(T) p G(I ₂ +V ₂ V ₂ ^(T))V ₁ S ⁻¹ z≧b−G(I ₂ +V ₂ V ₂ ^(T))V ₁ S ⁻¹ U ₁ ^(T) p

Therefore, the problem of minimizing ∥Eh₂=p∥² subject to the constraint Gh₂≧b is equivalent to minimizing ∥z∥² subject to G(I₂+V₂V₂ ^(T))V₁S⁻¹z≧b−G(I₂+V₂V₂ ^(T))V₁S⁻¹U₁ ^(T)p. From the solution {circumflex over (z)}, that minimize ∥z∥², the corresponding least squares solution, ĥ₂, of the appended reduced problem Eh₂=p can be found by the inversion of the equation z=SV₁ ^(T)h₂−U₁ ^(T)p. From the least squares solution, ĥ₂, of the appended reduced problem, Eh₂=p, the full impulse residue function, h, can be reconstituted by: $h = \begin{pmatrix} h_{1} \\ {\hat{h}}_{2} \end{pmatrix}$ and h₁ is a (I+L−1)×1 vector whose first I elements are zero and the subsequent L−1 elements are equal to the first element of ĥ₂.

In another embodiment, E has a rank of K=(N−M₁) and has the following singular value decomposition: ${E = {{U\begin{bmatrix} S \\ 0 \end{bmatrix}}V^{T}}},$ where S is a K×K diagonal matrix with its diagonal entries equal to the singular values of E, U and V are orthogonal matrices of dimensions M₂×M₂ and (N−M₁)×(N−M₁) respectively. The least squares solution, ĥ₂, of the appended reduced problem f=Eh₂ facilitates minimizing ∥Eh₂−p∥².

Using a singular value decomposition of E, ∥Eh₂−p∥² can be simplified as: $\begin{matrix} {{{{{Eh}_{2} - p}}^{2} = {{{{{U\begin{bmatrix} S \\ 0 \end{bmatrix}}V^{T}h_{2}} - p}}^{2} = {{{U^{T}{U\begin{bmatrix} S \\ 0 \end{bmatrix}}V^{T}h_{2}} - {U^{T}p}}}^{2}}},{{Since}\quad U^{T}\quad{is}\quad{orthogonal}}} \\ {= {{{{\begin{bmatrix} S \\ 0 \end{bmatrix}V^{T}h_{2}} - {U^{T}p}}}^{2} = {{{{\begin{bmatrix} S \\ 0 \end{bmatrix}V^{T}h_{2}} - {\begin{bmatrix} U_{1}^{T} \\ U_{2}^{T} \end{bmatrix}p}}}^{2} = {{\begin{bmatrix} {{SV}^{T}h_{2}} \\ 0 \end{bmatrix} - \begin{bmatrix} {U_{1}^{T}p} \\ {U_{2}^{T}p} \end{bmatrix}}}^{2}}}} \\ {= {{\begin{bmatrix} {{{SV}^{T}h_{2}} - {U_{1}^{T}p}} \\ {{- U_{2}^{T}}p} \end{bmatrix}}^{2} = {{{{{SV}^{T}h_{2}} - {U_{1}^{T}p}}}^{2} + {{U_{2}^{T}p}}^{2}}}} \end{matrix}$

since ∥U₂ ^(T)p∥² is constant, minimizing ∥Eh₂−p∥² is equivalent to minimizing ∥SV^(T)h₂−U₁ ^(T)p∥². In one embodiment, the variable h₂ is changed to z such that: z=SV^(T)h₂−U₁ ^(T)pV^(T)h₂=S⁻¹z+S⁻¹U₁ ^(T)p

Minimizing ∥Eh₂−p∥² is the same as minimizing ∥z∥² and the inequality constraint becomes: Gd₂≧b G(VV ^(T))h ₂ ≧b GV(S ⁻¹ z+S ⁻¹ U ₁ ^(T) p)≧b GVS ⁻¹ z≧b−GVS ⁻¹ U ₁ ^(T) p

Minimizing ∥Eh₂−p∥² subject to the constraint Gh₂≧b is equivalent to minimizing ∥z∥² subject to GVS⁻¹z≧b−GVS⁻¹U₁ ^(T)p.

A formulation of smoothness, nonnegative and monotonicity constraints for the reduced problem can now be stated. The least squares solution of the reduced problem: Q=A_(r)h₂ with the smoothness, nonnegative and monotonicity constraints can be recast as the least squares solution of the appended reduced problem according to: $\begin{pmatrix} q \\ {\gamma\quad d} \end{pmatrix} = {{\begin{bmatrix} A_{r} \\ {\gamma\quad S} \end{bmatrix}h_{2}\quad{or}\quad p} = {Eh}_{2}}$

with the constraint I_((N−M) ₁ _()×(N−M) ₁ ₎h₂≧0 and, Dh₂≧0, where D is a (N−M₁−1)×(N−M₁) matrix of the form: $D = \begin{bmatrix} 1 & {- 1} & 0 & \cdots & \cdots & \cdots & 0 & 0 & 0 \\ 0 & 1 & {- 1} & \cdots & \cdots & \cdots & 0 & 0 & 0 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & \cdots & \cdots & 1 & {- 1} & 0 \\ 0 & 0 & 0 & \cdots & \cdots & \cdots & 0 & 1 & {- 1} \end{bmatrix}$ such that Dh₂≧0 is equivalent to h₂(1)≧h₂(2)≧ . . . h₂(N−M₁). The two inequality constraints I_((N−M) ₁ _()×(N−M) ₁ ₎h₂≧0 and Dh₂≧0 can be combined into ${\begin{bmatrix} I_{{({N - M_{1}})}{x{({N - M_{1}})}}} \\ D_{{({N - M_{1} - 1})}{x{({N - M_{1}})}}} \end{bmatrix}h_{2}} \geq 0$ or, Gh₂≧0 where G is a 2(N−M₁−1)×(N−M₁) matrix as defined herein such that I_((N−M) ₁ _()×(N−M) ₁ ₎ is an (N−M₁)×(N−M₁) identity matrix.

The least squares solution of the appended reduced problem p=Eh₂ subject to the nonnegative and montonicity constraints can be determined using the method described herein. From the least squares solution, ĥ₂, of the appended reduced problem, Eh₂=p, the full impulse residue function, h, can be reconstituted by: $h = \begin{pmatrix} h_{1} \\ {\hat{h}}_{2} \end{pmatrix}$ and h₁ is a (I+L−1)×1 vector whose first I elements are zero and the subsequent L−1 elements are equal to the first element of ĥ₂.

In one embodiment, in tissue where there is no leakage of contrast from the blood stream into the interstitial space, for example, the brain with intact blood-brain-barrier, the reconstituted full impulse residue function h(t) can be used to determine Tissue Blood Flow (TBF) as the peak height of h(t), Tissue Blood Volume (TBV) as the area underneath h(t) and Tissue Mean Transit Time (TMTT) as the TBV divided by TBF.

In one embodiment, in tissue where there is leakage of contrast from the blood stream into the interstitial space, the impulse residue function h(t) can be modeled by the Johnson-Wilson model.

An adiabatic approximation of the Johnson-Wilson Model is then used to parameterize the impulse residue function in terms of TBF, TBV, TMTT and TPS. In one embodiment, the impulse residue function for the adiabatic approximation of the Johnson-Wilson model is: $\begin{matrix} {{R(t)} = \left\{ \begin{matrix} 0.0 & {t \leq t_{o}} \\ 1.0 & {t_{o} \leq t \leq {t_{o} + W}} \\ {Ee}^{- {k{({t - t_{o} - W})}}} & {t \geq {t_{o} + W}} \end{matrix} \right.} & (1) \end{matrix}$ where t_(o) is a time delay between an arterial curve of contrast concentration, C_(a)(t), and the tissue residue function, Q(t), W is the tissue mean transit time (TMTT), and k is the rate constant of the exponential function and is defined according to: $\begin{matrix} {k = \frac{FE}{V_{e}}} & (2) \end{matrix}$

where F is the Tissue Blood Flow (TBF), E is the extraction efficiency of contrast material from blood and V_(e) is the distribution space of contrast material in the intersitial space. Tissue Blood Volume is equal to TBF×TMTT. Tissue capillary permeability surface area product (TPS) is: −ln(1−E).

The tissue residue function, Q(t), is given by: Q(t)=F·[C _(a)(t)*R(t)]  (3)

-   -   where * is the convolution operation.

The linearization of the tissue residue function (or the expression of the tissue residue function or some t function of it in terms of linear functions of the parameters (or some combination of them) of the model) is based on finding the (time) integral of Q(t) according to: $\begin{matrix} {{\int_{0}^{T}{{Q(t)}{\mathbb{d}t}}} = {\int_{0}^{T}\quad{{\mathbb{d}t}{\int_{0}^{t}{{C_{a}(u)}\quad{R\left( {t - u} \right)}{\mathbb{d}u}}}}}} & \left( {4a} \right) \end{matrix}$

Interchanging the order of integration: $\begin{matrix} {{\int_{0}^{T}{{Q(t)}{\mathbb{d}t}}} = {{\int_{0}^{T}\quad{{\mathbb{d}u}{\int_{u}^{T}{{C_{a}(u)}\quad{R\left( {t - u} \right)}{\mathbb{d}t}}}}} = {{\int_{0}^{T}{{C_{a}(u)}{\mathbb{d}u}{\int_{u}^{T}{{R\left( {t - u} \right)}{\mathbb{d}t}}}}} = {\int_{0}^{T}{{C_{a}(u)}{\mathbb{d}u}{\int_{0}^{T - u}{{R(t)}{\mathbb{d}t}}}}}}}} & \left( {4b} \right) \end{matrix}$

The time integral ∫₀^(T)Q(t)𝕕t is evaluated for the three time intervals

-   (iii) (i) 0≦T≦t_(o) -   (iv) (ii) t_(o)*≦T≦t_(o)+W -   (V) t_(o)+W≦T

For example when the time integral ∫₀^(T)Q(t)𝕕t is evaluated for the time interval 0≦T≦t_(o), then ∫₀^(T)Q(t)𝕕t = ∫₀^(T)C_(a)(u)𝕕u∫₀^(T − u)R(t)𝕕t for 0≦u≦T0≧−u≧−TT≧T−u≧00≦T−u≦T≦t_(o), therefore: $\begin{matrix} {{\int_{0}^{T}{{Q(t)}{\mathbb{d}t}}} = 0} & (5) \end{matrix}$

When the time integral ∫₀^(T)Q(t)𝕕t is evaluated for the time interval t_(o)≦T≦t_(o)+W, then setting T=t_(o)+a, where a≦W, the time integral is: ${{\int_{0}^{T}{{Q(t)}{\mathbb{d}t}}} = {{F{\int_{0}^{t_{o} + a}{{C_{a}(u)}{\mathbb{d}u}{\int_{0}^{t_{o} + a - u}{{R(t)}{\mathbb{d}t}}}}}}\quad = \quad{{{F \cdot \left\lbrack {{\int_{0}^{a}{{C_{a}(u)}{\mathbb{d}u}}} + {\int_{a}^{t_{o} + a}{{C_{a}(u)}{\mathbb{d}u}}}} \right\rbrack}\left( {\int_{0}^{t_{o} + a - u}{{R(t)}{\mathbb{d}t}}} \right)}\quad = \quad{{F \cdot {\int_{o}^{a}{{C_{a}(u)}{\mathbb{d}u_{\underset{A}{︸}}}{\int_{0}^{t_{o} + a - u}{{R(t)}{\mathbb{d}t}}}}}} + {F \cdot {\int_{a}^{t_{o} + a}{{C_{a}(u)}{\mathbb{d}u}{\int_{0}^{t_{o} + a - u}{{R(t)}{\mathbb{d}t}}}}}}}}}}\quad$

-   A: For 0≦u≦a,t_(o)+a≧t_(o)+a−u≧t_(o) or t_(o)+W≧t_(o)+a−u≧t_(o),     then:     F∫₀^(a)C_(a)(u)  𝕕u  ∫₀^(t_(o) + a − u)R(  t)  𝕕t=  F  ∫₀^(a)C_(a)(  u)  𝕕u[  ∫_(o)^(t_(o))R(t)𝕕t + ∫_(t_(o))^(t_(o) + a − u)R(t)𝕕t]   = F∫₀^(a)C_(a)(u)𝕕u∫_(t_(o))^(t_(o) + a − u)R(t)𝕕t = F(a − u)∫₀^(a)C_(a)(u)𝕕u.   -   B: For a≦u≦a+t_(o),t_(o)≧t_(o)+a−u≧0, then     F * ∫_(a)^(t_(o) + a)C_(a)(u)  𝕕u∫₀^(t_(o) + a − u)R(t)  𝕕t = 0

Combining A and B above: $\begin{matrix} {{{\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}} = {F*{\int_{0}^{a}{\left( {a - u} \right){C_{a}(u)}\quad{\mathbb{d}u}\quad{or}}}}},\quad{{F\left\lbrack {{\left( {T - t_{o}} \right){\int_{0}^{T - t_{o}}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {\int_{0}^{T - t_{o}}{{{uC}_{a}(u)}\quad{\mathbb{d}u}}}} \right\rbrack} = {\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}}}} & \left( {6a} \right) \end{matrix}$

When the time integral ∫₀^(T)Q(t)  𝕕t is evaluated for the time interval T≧t_(o)+W, then and setting T=t_(o)+W+a, where a≧0 then ${\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}}\quad = \quad{{F \cdot \quad{\int_{0}^{T}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{T - u}{{R(t)}\quad{\mathbb{d}t}}}}}}\quad = {{F*{\int_{0}^{t_{o} + a + W}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}}\quad = {{F\left\lbrack {{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}} + {\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}} + {\int_{a + W}^{t_{o} + a + W}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}} \right\rbrack} = {\underset{\underset{C}{︸}}{F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{{t\quad 0} + a + w - u}{{R(t)}\quad{\mathbb{d}t}}}}}} + \underset{\underset{D}{︸}}{F{\int_{0}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{{t\quad 0} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}} + \underset{\underset{E}{︸}}{F{\int_{a + W}^{{t\quad 0} + a + W}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{{t\quad 0} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}}}}}}$

-   C: For 0≦u≦a,t_(o)+a+W≧t_(o)+a+W−u≧t_(o)+W, then     ${{{{{{{{F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}} = {F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}}}\quad}{\quad{\left\lbrack {{\int_{0}^{t_{o}}{{R(t)}\quad{\mathbb{d}t}}} + {\int_{0}^{t_{o} + W}{{R(t)}\quad{\mathbb{d}t}}} + {\int_{t_{o} + W}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}} \right\rbrack = {{F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}{u\left\lbrack {W + {\int_{t_{o} + W}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}} \right\rbrack}}}}} = {{{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{t_{o} + W}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}}} = {{{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {F{\int_{0}^{a}{{C(u)}\quad{\mathbb{d}u}{\int_{t_{o} + W}^{t_{o} + a + W - u}{E\quad{\mathbb{e}}^{- {k{({t - t_{o} - W})}}}\quad{\mathbb{d}t}}}}}}} = {{{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {{FE}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{a - u}{{\mathbb{e}}^{- {kt}}\quad{\mathbb{d}t}}}}}}} = {{{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}{u\left\lbrack {{\mathbb{e}}^{- {k{({a - u})}}} - 1} \right\rbrack}}}}}}\quad = {{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} +}}}}}}}\quad}{\quad{{{{{\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - \underset{\underset{F}{︸}}{\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{e}}^{- {k{({a - u})}}}{\mathbb{d}u}}}}}\quad{Q(T)}} = {{F{\int_{0}^{T}{{C_{a}(u)}\quad{R\left( {T - u} \right)}{\mathbb{d}u}}}} = {{{F{\int_{0}^{t_{o} + a + W}{{C_{a}(u)}{R\left( {t_{o} + a + W - u} \right)}\quad{\mathbb{d}u}}}}{F:}}\quad = {{{F{\int_{0}^{a}{{C_{a}(u)}\quad{R\left( {t_{o} + a + W - u} \right)}{\mathbb{d}u}}}} + {F{\int_{a}^{a + W}{{C_{a}(u)}{R\left( {t_{o} + a + W - u} \right)}\quad{\mathbb{d}u}}}} + {F{\int_{a + W}^{t_{o} + a + W}{{C_{a}(u)}{R\left( {t_{o} + a + W - u} \right)}\quad{\mathbb{d}u}}}}} = {{{FE}{\int_{0}^{a}{{C_{a}(u)}{\mathbb{e}}^{- {k{({a - u})}}}\quad{\mathbb{d}u}}}} + {F{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}\quad{Therefore}}}}}}}}},}\quad\quad}\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}{\mathbb{e}}^{- {k{({a - u})}}}\quad{\mathbb{d}u}}}} =}\quad}\frac{Q(T)}{k}} - {\frac{F}{k}{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}}}\quad$     and       ${F{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}{\int_{0}^{t_{o} + a + W - u}{{R(t)}\quad{\mathbb{d}t}}}}}} = {{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - \frac{Q(T)}{k} + {\frac{F}{k}{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}}}$     C:   -   D: For a≦u≦a+W,t_(o)+W−u≧t_(o)+a+W−u≧t_(o)t_(o)+W≧t_(o)+a+W−u≧t_(o)     F∫_(a)^(a + W)C_(a)(u)  𝕕u∫₀^(t_(o) + a + W − u)R(t)  𝕕t = F∫_(a)^(a + W)C_(a)(u)  𝕕u[∫₀^(t_(o))R(t)  𝕕t + ∫_(t_(o))^(t_(o) + a + W − u)R(t)  𝕕t] = F∫_(a)^(a + W)C_(a)(u)  𝕕u∫_(t_(o))^(t_(o) + a + W − u)R(t)  𝕕t = F[a + W − u]∫_(a)^(a + W)C_(a)(u)  𝕕u   -   E: For a+W≦u≦a+W+t_(o),t_(o)≧t_(o)+a+W−u≧0     F∫_(a + W)^(t_(o) + a + W)C_(a)(u)  𝕕u∫₀^(t_(o) + a + W − u)R(t)  𝕕t = 0     Therefore, for T−t_(o)+W+a, where a≧0: $\begin{matrix}     {{{\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}} = {{{FW}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {\frac{FE}{k}{\int_{0}^{a}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - \frac{Q(T)}{k} + {\frac{F}{k}{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {{F\left\lbrack {a + W - u} \right\rbrack}{\int_{0}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}}}}{{or},\quad{{QT} = {{{Fk}\left\lbrack {{W{\int_{0}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {a{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {\int_{a}^{a + W}{{{uC}_{a}(u)}\quad{\mathbb{d}u}}}} \right\rbrack} + {F{\int_{a}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {{FE}{\int_{0}^{a + W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {k{\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}}}}}}} & \left( {7a} \right) \\     {= {{{Fk}\left\lbrack {{W{\int_{0}^{T + t_{o}}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {\left( {T - t_{o} - W} \right){\int_{T - t_{o} - W}^{T - t_{o}}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {\int_{T - t_{o} - W}^{T - t_{o}}{{{uC}_{a}(u)}\quad{\mathbb{d}u}}}} \right\rbrack} + {F{\int_{T - t_{o} - W}^{T - t_{o}}{{C_{a}(u)}\quad{\mathbb{d}u}}}} + {{FE}{\int_{0}^{T - t_{o} - W}{{C_{a}(u)}\quad{\mathbb{d}u}}}} - {k{\int_{0}^{T}{{Q(t)}\quad{\mathbb{d}t}}}}}} & \left( {7b} \right)     \end{matrix}$

In one embodiment, the time integral ∫₀^(T)Q(t)  𝕕t for the three time intervals

-   (i) 0≦T≦t_(o) -   (ii) t_(o)≦T≦t_(o)+W -   (iii) t_(o)+W≦T     generates the following system of linear equations     0 = −k∫₀^(T)Q(t)  𝕕t  0 ≤ T ≤ t_(o)     0 = Fk[(T − t_(o))∫₀^(T − t_(o))C_(a)(u)  𝕕u − ∫₀^(T − t_(o))uC_(a)(u)  𝕕u] − k∫₀^(T)Q(t)  𝕕t  t_(o) ≤ T ≤ t_(o) + W     Q(T) = Fk[W∫₀^(T − t_(o))C_(a)(u)  𝕕u + (T − t_(o) − W)∫_(T − t_(o) − W)^(T − t_(o))C_(a)(u)  𝕕u − ∫_(T − t_(o) − W)^(T − t_(o))uC_(a)(u)  𝕕u] + F∫_(T − t_(o) − W)^(T − t_(o))C_(a)(u)  𝕕u + FE∫₀^(T − t_(o) − W)C_(a)(u)  𝕕u −     k∫₀^(T)Q(t)  𝕕t  T   ≥   t_(o) +   W     involving a plurality of unknowns Fk, F, FE and k, provided that t₀     and W are known.

For a set of given t₀ and W, a least squares algorithm is used to estimate Fk, F, FE and k subject to the following linear constraints:

-   Fk≧0 -   F≧0 -   FE≧0 -   k≧1 -   Fk≧F -   F≧FE

The algorithm for estimating t₀, W, Fk, F, FE and k includes two main golden section search subroutines. An outer golden section search subroutine searches for t₀, an inner golden section search subroutine searches for W with the value of t₀, assumed in the outer routine. Within the inner golden section search routine, values of t₀ and W are fixed and the optimization of Fk, F, FE and k can proceed with LDP algorithms.

In one embodiment, values of F, E, Ve and k are: F=0.1 ml/min/g, E=0.5, Ve0.25, interstitial space, and k=FE/Ve=O0.2 min−1=12s−1. In another embodiment, values of F, E, V_(e) and k are: F=0.1 ml/min/g, E=0.25, V_(e)0.25, interstitial space, and k=FE/V_(e)=0.1 min⁻¹=6s⁻¹.

Although k>=1 is the constraint, after solution, for any k>5s⁻¹ assumes that there is no leakage and do not calculate PS, and recalculate blood volume and MTT instead of taking W as MTT and EW as volume. The volume can be taken as the area underneath the flow scaled impulse residue function (F.R(t)), and MTT as the volume divided by the height of the flow scaled impulse residue function.

Discretization of the system of linear equations is performed according to:

Let Δt be the time interval, and t₀=mΔt, W=nΔt, and T=iΔt, then: $\begin{matrix} \begin{matrix} {0 = {{{- k}{\sum\limits_{j = 1}^{i}\quad{{Q(j)}\Delta\quad t\quad 0}}} \leq i \leq m}} \\ {0 = {{{{Fk}\left\lbrack {{\left( {i - m} \right)\Delta\quad t{\sum\limits_{j = 1}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}}} - {\sum\limits_{j = 1}^{i - m}\quad{j\quad{C_{a}(j)}\Delta\quad t}}} \right\rbrack} - {k{\sum\limits_{j = 1}^{i}\quad{{Q(j)}\Delta\quad t\quad m}}}} \leq i \leq {n + m}}} \\ {{Q(T)} = {{{Fk}\left\lbrack {{W{\sum\limits_{j = 1}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}}} + {\left( {i - m - n} \right)\Delta\quad t{\sum\limits_{j = {i - m - n}}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}}} - {\sum\limits_{j = {i - m - n}}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}}} \right\rbrack} +}} \\ {{{F{\sum\limits_{j = {i - m - n}}^{i - m - n}\quad{{C_{a}(j)}\Delta\quad t}}} + {{FE}{\sum\limits_{j = 1}^{i - m - n}\quad{{C_{a}(j)}\Delta\quad t}}} - {k{\sum\limits_{j = 1}^{i}\quad{{Q(j)}\Delta\quad t\quad i}}}} \geq {n + m}} \end{matrix} & (9) \end{matrix}$

The various sums involving the arterial function C_(a)(t) can be pre-calculated and stored in 2-dimensional arrays AAR and AFM. For example, $\sum\limits_{j = {i - m - n}}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}$ as the [(i−m−n),(i−m)]th element of Area array referred to herein as an arterial area array (AAR). Also, $\sum\limits_{j = {i - m - n}}^{i - m}\quad{{C_{a}(j)}\Delta\quad t}$ as the [(i−m−n),(i−m)]th element of First-moment array referred to herein as an arterial first moment array (AFM). The various sums involving the tissue residue function Q(t) can be pre-calculated and stored in a 1-dimensional array AQ. For example, $\sum\limits_{j = 1}^{i - m}\quad{{Q(j)}\Delta\quad t}$ as the ith element of an array for area of tissue residue function Q(t), (AQ).

A solution for F, E, and k when t₀ and W are known can be determined as follows: Using the arrays: Q, AAR, AFM and AQ, Eq. (9) can be written as Eq. (10): $\begin{bmatrix} {{Q(1)} = 0} \\ \vdots \\ {{Q(m)} = 0} \\ {{Q\left( {m + 1} \right)} = 0} \\ {{Q\left( {m + 2} \right)} = 0} \\ \vdots \\ {Q\left( {M + n} \right)} \\ {Q\left( {m + n + 1} \right)} \\ {Q\left( {m + n + 2} \right)} \\ \vdots \\ {Q\left( {m + n + p} \right)} \end{bmatrix} = {\begin{bmatrix} {0} & 0 & 0 & {- {{AQ}(1)}} \\ {\vdots} & \vdots & \vdots & \vdots \\ {0} & 0 & 0 & {- {{AQ}(m)}} \\ {{\Delta\quad{t \cdot {{AAR}\left( {1,1} \right)}}} - {{AFM}\left( {1,1} \right)}} & 0 & 0 & {- {{AQ}\left( {m + 1} \right)}} \\ {{2\Delta\quad{t \cdot {{AAR}\left( {1,2} \right)}}} - {{AFM}\left( {1,2} \right)}} & 0 & 0 & {- {{AQ}\left( {m + 2} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{{n \cdot \Delta}\quad{t \cdot {{AAR}\left( {1,n} \right)}}} - {{AFM}\left( {1,n} \right)}} & 0 & 0 & {- {{AQ}\left( {m + n} \right)}} \\ {{n \cdot \Delta \cdot {{AAR}\left( {1,{n + 1}} \right)}} + {\Delta\quad{t \cdot {{AAR}\left( {1,{n + 1}} \right)}}} - {{AFM}\left( {1,{n + 1}} \right)}} & {{AAR}\left( {1,1} \right)} & {{AAR}\left( {1,1} \right)} & {- {{AQ}\left( {m + n + 1} \right)}} \\ {{{n \cdot \Delta}\quad{t \cdot {{AAR}\left( {1,{n + 2}} \right)}}} + {{2 \cdot \Delta}\quad{T \cdot {{AAR}\left( {2,{n + 2}} \right)}}} - {{AFM}\left( {2,{n + 2}} \right)}} & {{AAR}\left( {2,{n + 2}} \right)} & {{AAR}\left( {1,2} \right)} & {- {{AQ}\left( {m + n + 2} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{{n \cdot \Delta}\quad{t \cdot {{AAR}\left( {1,{n + p}} \right)}}} + {{p \cdot \Delta}\quad{t \cdot {{AAR}\left( {p,{n + p}} \right)}}} - {{AFM}\left( {p,{n + p}} \right)}} & {{AAR}\left( {p,{n + p}} \right)} & {{AAR}\left( {1,p} \right)} & {- {{AQ}\left( {m + n + p} \right)}} \end{bmatrix}{\quad\begin{bmatrix} {Fk} \\ F \\ {FE} \\ k \end{bmatrix}}}$ or Q=Ax and: $Q = {{\begin{bmatrix} {{Q(1)} = 0} \\ \vdots \\ {{Q(m)} = 0} \\ {{Q\left( {m + 1} \right)} = 0} \\ {{Q\left( {m + 2} \right)} = 0} \\ \vdots \\ {Q\left( {M + n} \right)} \\ {Q\left( {m + n + 1} \right)} \\ {Q\left( {m + n + 2} \right)} \\ \vdots \\ {Q\left( {m + n + p} \right)} \end{bmatrix}A} = {{\begin{bmatrix} {0} & 0 & 0 & {- {{AQ}(1)}} \\ {\vdots} & \vdots & \vdots & \vdots \\ {0} & 0 & 0 & {- {{AQ}(m)}} \\ {{\Delta\quad{t \cdot {{AAR}\left( {1,1} \right)}}} - {{AFM}\left( {1,1} \right)}} & 0 & 0 & {- {{AQ}\left( {m + 1} \right)}} \\ {{2\Delta\quad{t \cdot {{AAR}\left( {1,2} \right)}}} - {{AFM}\left( {1,2} \right)}} & 0 & 0 & {- {{AQ}\left( {m + 2} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {{\left. {{{n \cdot \Delta \cdot \Delta}\quad{t \cdot {AA}}\quad 1},n} \right)} - {{AFM}\left( {1,n} \right)}} & 0 & 0 & {- {{AQ}\left( {m + n} \right)}} \\ {{\left. {{{n \cdot \Delta \cdot \Delta \cdot {AA}}\quad 1},{n + 1}} \right)} + {\Delta\quad{t \cdot {{AAR}\left( {1,{n + 1}} \right)}}} - {{AFM}\left( {1,{n + 1}} \right)}} & {{AAR}\left( {1,{n + 1}} \right)} & {{AAR}\left( {1,1} \right)} & {- {{AQ}\left( {m + n + 1} \right)}} \\ {\left. {{\left. {{{n \cdot \Delta \cdot \Delta}\quad{t \cdot {AA}}\quad 1},{n + 2}} \right) + {{2 \cdot {\Delta\Delta}}\quad{T \cdot {AAR}}\quad 2}},{n + 2}} \right) - {{AFM}\left( {2,{n + 2}} \right)}} & {{AAR}\left( {2,{n + 2}} \right)} & {{AAR}\left( {1,2} \right)} & {- {{AQ}\left( {m + n + 2} \right)}} \\ \vdots & \vdots & \vdots & \vdots \\ {\left. {\left. {{{n \cdot \Delta \cdot \Delta}\quad{t \cdot {AA}}\quad 1},{n + p}} \right) + {{p \cdot \Delta \cdot \Delta}\quad{t \cdot {AARn}}} + p} \right) - {{AFM}\left( {p,{n + p}} \right)}} & {{AAR}\left( {p,{n + p}} \right)} & {{AAR}\left( {1,p} \right)} & {- {{AQ}\left( {m + n + p} \right)}} \end{bmatrix}x} = {\quad\begin{bmatrix} {Fk} \\ F \\ {FE} \\ k \end{bmatrix}}}}$ The constraints are: $\begin{matrix} {{{{\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & {- 1} & 0 & 0 \\ 0 & 1 & {- 1} & 0 \end{bmatrix}\begin{bmatrix} {Fk} \\ F \\ {FE} \\ k \end{bmatrix}} = {\begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \end{bmatrix}\quad{or}}},{{Gx} \geq b}}{G = {{\begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 1 & {- 1} & 0 & 0 \\ 0 & 1 & {- 1} & 0 \end{bmatrix}\quad{and}\quad b} = \begin{bmatrix} 0 \\ 0 \\ 0 \\ 1 \\ 0 \\ 0 \end{bmatrix}}}} & \text{(11a)} \end{matrix}$

Therefore, the solution for the model parameters given t₀ and W can be stated as linear least squares problem for x according to q=Ax, subject to the linear inequality constraints Gx≧b wherein q is a (m+n+p)×1 vector, A is a (m+n+p)×4 matrix, b is a 6×1 vector, and x is a 4×1 vector of the model parameters. In one embodiment, A has a rank of 4, i.e., full column rank and has the following singular value decomposition: ${A = {{U\begin{bmatrix} S \\ O \end{bmatrix}}V^{T}}},$ where S is a 4×4 diagonal matrix with its diagonal entries equal to the singular values of A, U and V are orthogonal matrices of dimensions (m+n+p)×(m+n+p) and 4×4 respectively.

The least squares solution, {circumflex over (x)}, of the least squares problem Q=Ax will minimize ∥Ax−Q∥². Using the singular value decomposition of A, ∥Ax−Q∥² can be simplified as ${{{{{Ax} - Q}}^{2} = {{{{{U\begin{bmatrix} S \\ 0 \end{bmatrix}}V^{T}x} - Q}}^{2} = {{U^{T}{U\begin{bmatrix} S \\ 0 \end{bmatrix}}V^{T}x} - {U^{T}Q}}}}}^{2},$ since U^(T) is orthogonal, ${= {{{{\begin{bmatrix} S \\ 0 \end{bmatrix}V^{T}x} - {U^{T}Q}}}^{2} = {{\begin{bmatrix} {{SV}^{T}x} \\ 0 \end{bmatrix} - \begin{bmatrix} {U_{1}^{T}Q} \\ {U_{2}^{T}Q} \end{bmatrix}}}^{2}}},{{and} = {{\begin{matrix} {{{SV}^{T}x} - {U_{1}^{T}Q}} \\ {{- U_{2}^{T}}Q} \end{matrix}}^{2} = {{{{{SV}^{T}x} - {U_{1}^{T}Q}}}^{2} + {{U_{2}^{T}Q}}^{2}}}}$

Since ∥U₂ ^(T)Q∥² is constant, minimizing ∥Ax−Q∥² is equivalent to minimizing ∥SV^(T)x−U₁ ^(T)Q∥². In one embodiment, variable x is changed to z, therefore,

z=SV^(T)x−U₁ ^(T)QV^(T)x=S⁻¹z+S⁻¹U₁ ^(T)Q. Minimizing ∥Ax−Q∥² is the same as minimizing ∥z∥². Therefore, the inequality constraint becomes: Gx≧b G((VV ^(T))x≧b GV(S ⁻¹ z+S ⁻¹ U ₁ ^(T) Q)≧b GV(S ⁻¹ z+S ⁻¹ U ₁ ^(T) Q)≧b GVS ⁻¹ z≧b−GVS ⁻¹ U ₁ ^(T) Q

Therefore, minimizing ∥Ax−Q∥² subject to the constraint GX≧b is equivalent to minimizing ∥z∥² subject to GVS⁻¹z≧b−GVS⁻¹U₁ ^(T)Q. In one embodiment, the coefficient matrix of the above system of linear systems will be singular value decomposed (SVD). It can be seen that the coefficient matrix is dependent on Q(t), this means that the SVD of the coefficient matrix has to be repeated for each tissue residue function. The coefficient matrix is N×4 where N is the number of data points of the tissue residue function. The first 3 columns of each coefficient matrix is the same being only dependent on the arterial function. Therefore, SVD of the N×3 matrix can be calculated, and for each tissue residue function, the fourth column is appended according to: $\left\lbrack {{{- k}{\sum\limits_{j = 1}^{1}\quad{{Q(j)}\Delta\quad t}}},{k{\sum\limits_{j = 1}^{2}\quad{Q(j)\Delta\quad t}}},{k{\sum\limits_{j = 1}^{3}\quad{Q(j)\Delta\quad t}}},\cdots\quad,{k{\sum\limits_{j = 1}^{N}\quad{Q(j)\Delta\quad t}}}} \right\rbrack^{T}.$

The SVD of the N×4 coeffficient matrix is then calculated from an update of the SVD of the basic N×3 matrix. In one embodiment, the effect of partial volume averaging (PVA) of the arterial curve on the determination of F and V with the deconvolution method can be determined. For example, letting Q(t) be the brain curve of specific mass of contrast in tissue, C_(a)(t) be the arterial curve of contrast concentration, R(t) be the impulse residue function, F be the blood flow, V be the blood volume, and MTT be the mean transit time. Then, if blood flow is stationary and CT measurement is linear with respect to contrast concentration, by principle of linear superposition then Q(t)=FC_(a)(t)*R(t).

Also, if the arterial curve is underestimated due to partial volume averaging from the finite resolution of CT scanners (˜8 lp/cm) then C_(a)′(t)=k.C_(a)(t), where C_(a)′(t) is the arterial curve measured with partial volume averaging (PVA) and k is the multiplicative factor due to PVA, which is less than one. Therefore, ${Q(t)} = {\frac{F}{k}{C_{a}^{\prime}(t)}*{{R(t)}.}}$ The deconvolution between Q(t) and C_(a)′(t) gives $\frac{F}{k}{{R(t)}.}$ The maximum height of $\frac{F}{k}{R(t)}\quad{is}\quad\frac{F}{k}$ and the area underneath $\frac{F}{k}{R(t)}\quad{is}\quad{\frac{V}{k}.}$ This explains why when a partial volume averaged arterial curve is used in the deconvolution with the brain curve, both F and V are scaled by $\frac{1}{k}{\left( {> 1} \right).}$ Note that ${MTT} = \frac{F}{V}$ is not scaled even in this case when the arterial curve is measured with partial volume averaging.

In one embodiment, a correction for partial volume averaging of the arterial curve uses the factor k such that C_(a)′(t)=k*C_(a)(t), therefore $k = {\frac{\int_{0}^{oo}{{C_{a}^{\prime}(t)}{\mathbb{d}t}}}{\int_{0}^{oo}{{C_{a}(t)}{\mathbb{d}t}}}.}$ Note that C_(a)′(t) is the measured (known) arterial curve i.e. the integral in the numerator can be calculated, while C_(a)(t) is the true arterial curve which is unknown. If we assume that there exist regions in veins which are free of partial volume averaging, then unlike arterial curves, venous curves can be measured accurately.

For example, let h(t) be the transit time spectrum from artery to veins, therefore C_(v)(t)=C_(a)(t)*h(t). Since h(t) is a transit time spectrum, by definition ∫₀^(oo)h(t)  𝕕t = 1. Therefore ${{\int_{0}^{oo}{{C_{v}(t)}\quad{\mathbb{d}t}}} = {\int_{0}^{oo}{{C_{a}(t)}\quad{\mathbb{d}t}}}},{{{and}\quad k} = \frac{\int_{0}^{oo}{{C_{a}^{\prime}(t)}\quad{\mathbb{d}t}}}{\int_{0}^{oo}{{C_{v}(t)}\quad{\mathbb{d}t}}}},$ where k is expressed in terms of the partial volume averaged arterial curve (C_(a)′(t)) and the venous curve C_(v)(t). Both of which are known (measured). In one embodiment, C_(a)′(t) and C_(v)(t) do not return to baseline during the measurement time, therefore integration to infinity is not desirable since C_(v)(t)=C(t)*h(t), and therefore, ${C_{v}(t)} = {{C_{a}^{\prime}(t)}*{\frac{h(t)}{k}.}}$ In other words, $\frac{h(t)}{k}$ can be obtained by deconvolution between C_(v)(t) and C_(a)′(t), for example if C_(a ex)′(t) is the extrapolated arterial curve obtained by extrapolation of the trailing slope of C_(a)′(t) with an exponential function. C_(a ex)′(t) returns to baseline very rapidly such that ∫_(o)^(oo)C_(a, ex)^(′)(t)𝕕t can be easily calculated. Since $\frac{h(t)}{k}$ and C_(a ex)′(t) are both known, their convolution can be calculated as ${C_{v,{ex}}(t)} = {{C_{a,{ex}}^{\prime}(t)}*{\frac{h(t)}{k}.}}$ Similar to C_(a,ex)′(t),C_(v,ex)(t) also returns rapidly to zero baseline and ${{\int_{0}^{oo}{{C_{v,{ex}}(t)}{\mathbb{d}t}}} = {\frac{1}{k}{\int_{0}^{oo}{{C_{a,{ex}}^{\prime}(t)}{\mathbb{d}t}}}}},$ or ${k = {\frac{\int_{0}^{oo}{{C_{a,{ex}}^{\prime}(t)}{\mathbb{d}t}}}{\int_{0}^{oo}{{C_{v,{ex}}(t)}{\mathbb{d}t}}} = \frac{\int_{o}^{T}{{C_{a,{ex}}^{\prime}(t)}{\mathbb{d}t}}}{\int_{0}^{T}{{C_{v,{ex}}(t)}{\mathbb{d}t}}}}},$ where [0,T] is the time interval within which C_(a,ex)′(t) and C_(v,ex)(t) first increase from zero baseline and then decrease back to zero baseline again. Therefore, the time shift between C_(a,ex)′(t) and C_(v,ex)(t) will not affect the calculation of k.

While the invention has been described in terms of various specific embodiments, those skilled in the art will recognize that the invention can be practiced with modification within the spirit and scope of the claims. 

1. A method for determining tissue type, said method comprising: quantitatively determining a tissue blood flow (TBF) by deconvoluting Q(t) and C_(a)(t), where Q(t) is a tissue residue function and represents a curve of specific mass of contrast in tissue, and C_(a)(t) represents an arterial curve of contrast concentration for a tissue having a blood stream containing a contrast without leaking the contrast into an interstitial space of the tissue by solving a matrix equation of Q=Ah for a vector h, and determining a least squares solution for the vector h under an equality constraint, wherein vector h includes a plurality of elements comprising an impulse residue function at different times Q comprises a vector including elements comprising values of a tissue residue function at different times, A comprises a matrix formed by values of the arterial curve of contrast concentration at different times; quantitatively determining a tissue blood volume (TBV) by deconvoluting Q(t) and C_(a)(t), quantitatively determining a TBV comprises quantitatively determining a TBV for the tissue by solving the matrix equation of Q=Ah for the vector h, and determining a least squares solution for the vector h under an equality constraint; quantitatively determining a tissue mean transit time (TMTT) by deconvoluting Q(t) and C_(a)(t), quantitatively determining a TMTT comprises quantitatively determining a TMTT for the tissue by solving the matrix equation of Q=Ah for the vector h, and determining a least squares solution for the vector h under an equality constraint; and determining a tissue type based on the TBF, the TBV, and the TMTT.
 2. A method in accordance with claim 1 wherein determining a least squares solution comprises determining a least squares solution for the vector h under a time causality constraint and a minimum transit time constraint.
 3. A method in accordance with claim 2 wherein determining a least squares solution further comprises determining a least squares solution for the vector h under a smoothness constraint, a nonnegativity constraint, and a monotonicity constraint, wherein the smoothness constraint forces h to be smoothly varying, and the monotonicity and nonnegativity constraints force h to start at a maximum and then monotonically decreases towards a zero baseline.
 4. A method in accordance with claim 1 further comprising quantitatively determining a partial volume averaging scaling factor for the arterial curve of contrast concentration by: deconvoluting the measured arterial curve of contrast concentration with a venous curve of contrast concentration to determine a transit time spectrum through a tissue of interest; extrapolating the arterial curve; and convolving the extrapolated arterial curve with the transit time spectrum to generate an extrapolated venous curve, wherein the partial volume averaging scaling factor is the ratio of an area underneath the extrapolated arterial curve to an area underneath the extrapolated venous curve.
 5. A method in accordance with claim 1 wherein the TBF is a cerebral blood flow (CBF), the TBV is a cerebral blood volume (CBV), and the TMTT is a cerebral mean transit time (CMTT), said determining a tissue type based on the TBF, the TBV, and the TMTT comprises determining one of a viable tissue and a non-viable tissue based on the CBF, the CBV, and the CMTT.
 6. A method for determining tissue type, said method comprising: quantitatively determining a tissue blood flow (TBF) by deconvoluting Q(t) and C_(a)(t), and their combinations thereof, where Q(t) is a tissue residue function and represents a curve of specific mass of contrast in tissue, and C_(a)(t) represents an arterial curve of contrast concentration for a tissue having a blood stream containing a contrast with leaking the contrast into an interstitial space of the tissue by solving a matrix equation of Q=Ax from the linearization of the tissue residue function for a vector x, wherein vector x includes a plurality of elements comprising TBF, tissue blood volume TBV, tissue mean transit time TMTT, tissue permeability surface area TPS and combinations thereof, Q comprises a vector including elements comprising values of a tissue residue function at different times, A comprises a matrix formed by values of the arterial curve of contrast concentration and tissue residue function at different times and their combinations thereof, quantitatively determining a TBF comprises quantitatively determining a TBF for the tissue by solving the matrix equation of Q=Ax for the vector x, quantitatively determining a TBV comprises quantitatively determining a TBV for the tissue by solving the matrix equation of Q=Ax for the vector x, quantitatively determining a TMTT comprises quantitatively determining a TMTT for the tissue by solving the matrix equation of Q=Ax for the vector x, quantitatively determining a TPS comprises quantitatively determining a TPS for the tissue by solving the matrix equation of Q=Ax for the vector x; and determining a tissue type based on the TBF, TBV, TMTT, and the TPS.
 7. A method in accordance with claim 6 further comprising determining a least squares solution for the TBF, the TBV, the TMTT, and the TPS under a nonnegativity constraint that determines a TBV, a TBF, a TMTT and a TPS for the tissue where there is leakage of the contrast from the blood stream into the interstitial space.
 8. A method in accordance with claim 6 further comprising quantitatively determining a partial volume averaging scaling factor for the arterial curve of contrast concentration by: deconvoluting the measured arterial curve of contrast concentration with a venous curve of contrast concentration to determine a transit time spectrum through a tissue of interest; extrapolating the arterial curve; and convolving the extrapolated arterial curve with the transit time spectrum to generate an extrapolated venous curve, wherein the partial volume averaging scaling factor is the ratio of an area underneath the extrapolated arterial curve to an area underneath the extrapolated venous curve.
 9. An imaging system comprising at least one of a computed tomography system and a nuclear magnetic resonance system, said imaging system configured to: measure Q(t) and C_(a)(t), where Q(t) is a tissue residue function and represents a curve of specific mass of contrast in tissue, and C_(a)(t) represents an arterial curve of contrast concentration; quantitatively determine a tissue blood flow (TBF) for a tissue having a blood stream containing a contrast without leaking the contrast into an interstitial space of the tissue by solving a matrix equation of Q=Ah for a vector h, and determining a least squares solution for the vector h under an equality constraint, wherein vector h includes a plurality of elements comprising an impulse residue function at different times, Q comprises a vector including elements comprising values of a tissue residue function at different times, A comprises a matrix formed by values of the arterial curve of contrast concentration at different times; quantitatively determine a tissue blood volume (TBV) for the tissue by solving the matrix equation of Q=Ah for the vector h, and determining a least squares solution for the vector h under an equality constraint; quantitatively determine a TMTT for the tissue by solving the matrix equation of Q=Ah for the vector h, and determining a least squares solution for the vector h under an equality constraint; and determine a tissue type based on the TBF, the TBV, and the TMTT.
 10. A system according to claim 9 further configured to determine a least squares solution for the vector h under a time causality constraint and a minimum transit time constraint.
 11. A system according to claim 9 further configured to determine a least squares solution for the vector h under a smoothness constraint, a nonnegativity constraint, and a monotonicity constraint, wherein the smoothness constraint forces h to be smoothly varying, and the monotonicity and nonnegativity constraints force h to start at a maximum and then monotonically decreases towards a zero baseline.
 12. An imaging system comprising at least one of a computed tomography system and a nuclear magnetic resonance system, said imaging system configured to: measure Q(t) and C_(a)(t), where Q(t) is a tissue residue function and represents a curve of specific mass of contrast in tissue, and C_(a)(t) represents an arterial curve of contrast concentration; quantitatively determine a tissue blood flow (TBF) for a tissue having a blood stream containing a contrast with leaking the contrast into an interstitial space of the tissue by solving a matrix equation of Q=Ax from the linearization of the tissue residue function for a vector x, wherein vector x includes a plurality of elements comprising TBF, tissue blood volume (TBV), tissue mean transit time (TMTT), tissue permeability surface area product (TPS) and combinations thereof, Q comprises a vector including elements comprising values of a tissue residue function at different times, A comprises a matrix formed by values of the arterial curve of contrast concentration and tissue residue function at different times and combinations thereof; quantitatively determine a TBV for the tissue by solving the matrix equation of Q=Ax for the vector x; quantitatively determine a TMTT for the tissue by solving the matrix equation of Q=Ax for the vector x; quantitatively determine a TPS for the tissue by solving the matrix equation of Q=Ax for the vector x; and determine a tissue type based on the TBF, the TBV, the TMTT, and the TPS.
 13. A system according to claim 12 further configured to determine a least squares solution for the TBF, the TBV, the TMTT, and the TPS under a nonnegativity constraint that determines a TBV, a TBF, a TMTT and a TPS for the tissue where there is leakage of the contrast from the blood stream into the interstitial space.
 14. A system according to claim 12 wherein the TBF is a cerebral blood flow (CBF), the TBV is a cerebral blood volume (CBV), the TMTT is a cerebral mean transit time (CMTT), the TPS is a cerebral TPS, said system further configured to determine one of a viable tissue and a non-viable tissue based on the CBF, the CBV, the CMTT, and the cerebral TPS. 